The discrete logarithm problem modulo one: cryptanalysing the Ariffin-Abu cryptosystem
نویسنده
چکیده
The paper provides a cryptanalysis the AAβ-cryptosystem recently proposed by Ariffin and Abu. The scheme is in essence a key agreement scheme whose security is based on a discrete logarithm problem in the infinite (additive) group R/Z (the reals modulo 1). The paper breaks the AAβ-cryptosystem (in a passive adversary model) by showing that this discrete logarithm problem can be efficiently solved in practice.
منابع مشابه
Cryptanalysing the critical group: efficiently solving Biggs's discrete logarithm problem
Biggs has recently proposed the critical group of a certain class of finite graphs as a platform group for cryptosystems relying on the difficulty of the discrete log problem. The paper uses techniques from the theory of Picard groups on finite graphs to show that the discrete log problem can be efficiently solved in Biggs’s groups. Thus this class of groups is not suitable as a platform for di...
متن کاملA Factoring and Discrete Logarithm based Cryptosystem
This paper introduces a new public key cryptosystem based on two hard problems : the cube root extraction modulo a composite moduli (which is equivalent to the factorisation of the moduli) and the discrete logarithm problem. These two hard problems are combined during the key generation, encryption and decryption phases. By combining the IFP and the DLP we introduce a secure and efficient publi...
متن کاملPublic Key Cryptosystem based on Number Theoretic Transforms
In this paper a Public Key Cryptosystem is proposed using the number theoretic transforms (NTT) over a ring of integer modulo a composite number. The key agreement is similar to ElGamal public key algorithm. The security of the system is based on solution of multivariate linear congruence equations and discrete logarithm problem. In the proposed cryptosystem only fixed numbers of multiplication...
متن کاملDiscrete logarithms in curves over finite fields
The discrete logarithm problem in finite groups is one of the supposedly difficult problems at the foundation of asymmetric or public key cryptography. The first cryptosystems based on discrete logarithms were implemented in the multiplicative groups of finite fields, in which the discrete logarithm problem turned out to be easier than one would wish, just as the factorisation problem at the he...
متن کاملThe Computational Difficulty of Solving Cryptographic Primitive Problems Related to the Discrete Logarithm Problem
To the authors’ knowledge, there are not many cryptosystems proven to be as difficult as or more difficult than the discrete logarithm problem. Concerning problems related to the discrete logarithm problem, there are problems called the double discrete logarithm problem and the e-th root of the discrete logarithm problem. These two problems are likely to be difficult and they have been utilized...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Mathematical Cryptology
دوره 4 شماره
صفحات -
تاریخ انتشار 2010